package second.dp;

public class Solution04 {
    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length];
        dp[0] = 0;
        dp[1] = 0;
        int len = cost.length;
        for (int i = 2; i < len; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return Math.min(dp[len - 2] + cost[len - 2], dp[len - 1] + cost[len - 1]);
    }
}
